The Iterated Restricted Immediate Snapshot Model

نویسندگان

  • Sergio Rajsbaum
  • Michel Raynal
  • Corentin Travers
چکیده

In the Iterated Immediate Snapshot model (IIS) the memory consists of a sequence of one-shot Immediate Snapshot (IS) objects. Processes access the sequence of IS objects, one-by-one, asynchronously, in a wait-free manner; any number of processes can crash. Its interest lies in the elegant recursive structure of its runs, hence of the ease to analyze it round by round. In a very interesting way, Borowsky and Gafni have shown that the IIS model and the read/write model are equivalent for the wait-free solvability of decision tasks. This paper extends the benefits of the IIS model to partially synchronous systems. Given a shared memory model enriched with a failure detector, what is an equivalent IIS model? The paper shows that an elegant way of capturing the power of a failure detector and other partially synchronous systems in the IIS model is by restricting appropriately its set of runs, giving rise to the Iterated Restricted Immediate Snapshot model (IRIS).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Iterated Restricted Immediate Snapshot Model S. Rajsbaum M. Raynal C. Travers

In the Iterated Immediate Snapshot model (IIS ) the memory consists of a sequence of one-shot Immediate Snapshot (IS ) objects. Each IS object can be accessed with an operation that atomically writes a value and returns a snapshot of its contents. Each process can access each IS object at most once. Processes access the sequence of IS objects, one-by-one, asynchronously, in a wait-free manner; ...

متن کامل

On the Wait - Free Power of Iterated - Immediate - Snapshots

The Iterated Immediate Snapshot model, introduced recently, has proved its usefulness. Its rich structure provided alternative simple derivation of past results, and its topological equivalence to the Euclidean Unit Simplex provides insights into new problems. Central to the model usefulness is the fact that it was shown to be non-blocking equivalent to the Atomic-Snapshot memory model and as a...

متن کامل

Read-Write Memory and k-Set Consensus as an Affine Task

The wait-free read-write memory model has been characterized as an iterated Immediate Snapshot (IS) task. The IS task is affine—it can be defined as a (sub)set of simplices of the standard chromatic subdivision. It is known that the task of Weak Symmetry Breaking (WSB) cannot be represented as an affine task. In this paper, we highlight the phenomenon of a “natural” model that can be captured b...

متن کامل

The Read/Write Protocol Complex Is Collapsible

The celebrated asynchronous computability theorem provides a characterization of the class of decision tasks that can be solved in a wait-free manner by asynchronous processes that communicate by writing and taking atomic snapshots of a shared memory. Several variations of the model have been proposed (immediate snapshots and iterated immediate snapshots), all equivalent for wait-free solution ...

متن کامل

Compact Topology of Shared-Memory Adversaries

The paper proposes a simple topological characterization of a large class of adversarialdistributed-computing models via affine tasks: sub-complexes of the second iteration of thestandard chromatic subdivision. We show that the task computability of a model in the classis precisely captured by iterations of the corresponding affine task. While an adversary is ingeneral defined a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008